#include <iostream>
#include <cstring>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <set>
#include <bitset>
#include <utility>
using namespace std;

const double eps = 1e-6;
const int INF = 0x3f3f3f3f;

typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
typedef pair<int, LL> PIL;

inline void quickread() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
}

const int N = 4e5 + 10;

int n;
int num[N], idx;

inline void solution() {
    idx = 0;
    for (int _ = 1; _ <= 2; _ ++ ) {
        cin >> n;
        for (int i = 0; i < n; i ++ ) {
            cin >> num[idx ++ ];
        }
    }
    sort(num, num + idx);
    idx = idx % 2 == 1 ? (idx + 1) / 2 - 1 : idx / 2 - 1;
    cout <<  num[idx] << endl;
}

int main() {
    freopen("input.txt", "r", stdin);
    quickread();
    solution();
    return 0;
}